Constructing a Two-Level Topology-Aware Distributed Hash Table with a Hierarchical Network Coordinate System
نویسندگان
چکیده
Distributed Hash Tables (DHTs) may suffer from a high lookup latency due to the issue of topology mismatching between the overlay and the physical underlying network. To handle this problem, recently, some researchers use network coordinates (NCs) to construct topology-aware DHTs(e.g. Canary). However, these proposed DHTs still have room to be improved due to the inaccuracy of NCs. To construct a more efficient DHT, in this paper, we propose hCanary: a two-level topology-aware CAN. The novelty of hCanary is that it uses a hierarchical NC system Pharos to generate more accurate NCs to construct multiple local topology-aware overlays over a global topology-aware CAN to reduce lookup latency. Meanwhile, we further use expressway technique to improve the ability of query forwarding of hCanary. Experiments show local overlays of hCanary can reduce average lookup latency by up to 60% and hCanary with expressways can reduce average lookup latency by up to 77% compared with Canary.
منابع مشابه
A Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables
Several structured peer-to-peer networks have been created to solve the scalability problem of previous peer-to-peer systems such as Gnutella and Napster. These peer-to-peer networks which support distributed hash table functionality construct a sort of structured overlay network, which can cause a topology mismatch between the overlay and the underlying physical network. To solve this mismatch...
متن کاملHierarchical Structured Peer-to-Peer Networks
Structured peer-to-peer systems or distributed hash tables (DHT) are self-organizing distributed systems designed to support efficient and scalable lookups with dynamic network topology changes. Nodes are organized as structured overlay networks, and data is mapped to nodes in the overlap network based on their identifier. There are two main types of structured peer-to-peer architectures: flat ...
متن کاملOasis: A Hierarchical EMST Based P2P Network
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and event notification services. P2P systems based on Distributed Hash Table (DHT) such as CAN, Chord, Pastry and Tapestry, use uniform hash functions to ensure load balance in the participant nodes. But their evenly dist...
متن کاملA framework for inter-domain routing in virtual coordinate based mobile networks
Routing is considered to be one the most challenging problems in mobile ad hoc networks. It has been shown that the use of virtual coordinates or identifiers for efficient routing and data management has several advantages compared to classical topology control techniques based on pre-defined addresses or geographical coordinates. However, these advantages only hold for single domain networks w...
متن کاملDistributed Document Sharing with Text Classification over Content-Addressable Network
Content-addressable network is a scalable and robust distributed hash table providing distributed applications to store and retrieve information in an efficient manner. We consider design and implementation issues of a document sharing system over a content-addressable overlay network. Improvements and their applicability on a document sharing system are discussed. We describe our system protot...
متن کامل